runtime.stack.hi (field)

104 uses

	runtime (current package)
		cgo_sigaction.go#L58: 		case sp < g.stack.lo || sp >= g.stack.hi:
		cgocall.go#L253: 	inBound := sp > g0.stack.lo && sp <= g0.stack.hi
		cgocall.go#L281: 	g0.stack.hi = sp + 1024
		cgocall.go#L302: 			g0.stack.hi = bounds[1]
		checkptr.go#L91: 	if gp := getg(); gp.stack.lo <= uintptr(p) && uintptr(p) < gp.stack.hi {
		debugcall.go#L38: 	if sp := sys.GetCallerSP(); !(getg().stack.lo < sp && sp <= getg().stack.hi) {
		malloc.go#L593: 			vmaSize = sys.Len64(uint64(getg().m.g0.stack.hi)) + 1
		malloc.go#L1954: 	if mp.curg.stack.lo <= uintptr(ptr) && uintptr(ptr) < mp.curg.stack.hi {
		mbitmap.go#L1946: 	if gp := getg(); gp.m.curg.stack.lo <= uintptr(p) && uintptr(p) < gp.m.curg.stack.hi {
		mcleanup.go#L816: 	racefree(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		mcleanup.go#L818: 	racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		mcleanup.go#L833: 	racefree(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		mcleanup.go#L835: 	racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		mgc.go#L2317: 	if gp.stack.lo <= p2 && p2 < gp.stack.hi {
		mgcmark.go#L375: 		gp.stack.hi = 0
		mgcmark.go#L936: 	scannedSize := gp.stack.hi - sp
		mgcmark.go#L960: 		print("scanning async preempted goroutine ", gp.goid, " stack [", hex(gp.stack.lo), ",", hex(gp.stack.hi), ")\n")
		mgcmark.go#L1498: 					if stk != nil && p >= stk.stack.lo && p < stk.stack.hi {
		mgcmark.go#L1537: 			if state != nil && state.stack.lo <= val && val < state.stack.hi {
		mgcmark.go#L1582: 		if state != nil && state.stack.lo <= val && val < state.stack.hi {
		mgcstack.go#L203: 	if p < s.stack.lo || p >= s.stack.hi {
		os_linux.go#L171: 	stk := unsafe.Pointer(mp.g0.stack.hi)
		panic.go#L1388: 	if sp != 0 && (sp < gp.stack.lo || gp.stack.hi < sp) {
		panic.go#L1389: 		print("recover: ", hex(sp), " not in [", hex(gp.stack.lo), ", ", hex(gp.stack.hi), "]\n")
		proc.go#L598: 		print("runtime: morestack on g0, stack [", hex(g.stack.lo), " ", hex(g.stack.hi), "], sp=", hex(g.sched.sp), ", called from\n")
		proc.go#L1875: 		size := gp.stack.hi
		proc.go#L1879: 		gp.stack.hi = uintptr(noescape(unsafe.Pointer(&size)))
		proc.go#L1880: 		gp.stack.lo = gp.stack.hi - size + 1024
		proc.go#L2514: 	gp.sched.sp = gp.stack.hi
		proc.go#L2660: 	g0.stack.hi = 0
		proc.go#L4495: 		memclrNoHeapPointers(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		proc.go#L4508: 	gcController.addScannableStack(pp, -int64(gp.stack.hi-gp.stack.lo))
		proc.go#L4658: 	if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
		proc.go#L4660: 			print("entersyscall inconsistent sp ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
		proc.go#L4664: 	if gp.syscallbp != 0 && gp.syscallbp < gp.stack.lo || gp.stack.hi < gp.syscallbp {
		proc.go#L4666: 			print("entersyscall inconsistent bp ", hex(gp.syscallbp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
		proc.go#L4810: 	if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
		proc.go#L4815: 			print("entersyscallblock inconsistent sp ", hex(sp1), " ", hex(sp2), " ", hex(sp3), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
		proc.go#L4839: 	if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
		proc.go#L4841: 			print("entersyscallblock inconsistent sp ", hex(sp), " ", hex(gp.sched.sp), " ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
		proc.go#L4845: 	if gp.syscallbp != 0 && gp.syscallbp < gp.stack.lo || gp.stack.hi < gp.syscallbp {
		proc.go#L4847: 			print("entersyscallblock inconsistent bp ", hex(bp), " ", hex(gp.sched.bp), " ", hex(gp.syscallbp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
		proc.go#L5280: 				newg.valgrindStackID = valgrindRegisterStack(unsafe.Pointer(newg.stack.lo), unsafe.Pointer(newg.stack.hi))
		proc.go#L5326: 	if newg.stack.hi == 0 {
		proc.go#L5336: 	sp := newg.stack.hi - totalSize
		proc.go#L5380: 	gcController.addScannableStack(pp, int64(newg.stack.hi-newg.stack.lo))
		proc.go#L5470: 	stksize := gp.stack.hi - gp.stack.lo
		proc.go#L5476: 		gp.stack.hi = 0
		proc.go#L5530: 	if gp.stack.lo != 0 && gp.stack.hi-gp.stack.lo != uintptr(startingStackSize) {
		proc.go#L5537: 			gp.stack.hi = 0
		proc.go#L5550: 				gp.valgrindStackID = valgrindRegisterStack(unsafe.Pointer(gp.stack.lo), unsafe.Pointer(gp.stack.hi))
		proc.go#L5556: 			racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		proc.go#L5559: 			msanmalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		proc.go#L5562: 			asanunpoison(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
		runtime2.go#L464: 	hi uintptr
		secret.go#L93: 	return gp.stack.lo, gp.stack.hi
		signal_unix.go#L563: 	if sp >= mp.gsignal.stack.lo && sp < mp.gsignal.stack.hi {
		signal_unix.go#L575: 	if sp >= mp.g0.stack.lo && sp < mp.g0.stack.hi {
		signal_unix.go#L586: 		st := stackt{ss_size: mp.g0.stack.hi - mp.g0.stack.lo}
		signal_unix.go#L1120: 	print("mp.gsignal stack [", hex(mp.gsignal.stack.lo), " ", hex(mp.gsignal.stack.hi), "], ")
		signal_unix.go#L1121: 	print("mp.g0 stack [", hex(mp.g0.stack.lo), " ", hex(mp.g0.stack.hi), "], sp=", hex(sp), "\n")
		signal_unix.go#L1433: 	gp.m.gsignal.stack.hi = stsp + st.ss_size
		signal_unix.go#L1455: 	st := stackt{ss_size: s.hi - s.lo}
		slice.go#L306: 		if gp := getg(); uintptr(oldPtr) < gp.stack.lo || gp.stack.hi <= uintptr(oldPtr) {
		stack.go#L466: 	n := stk.hi - stk.lo
		stack.go#L470: 	if stk.lo+n < stk.hi {
		stack.go#L626: 	if adjinfo.old.lo <= p && p < adjinfo.old.hi {
		stack.go#L654: 	maxp := adjinfo.old.hi
		stack.go#L720: 			if bp != 0 && (bp < adjinfo.old.lo || bp >= adjinfo.old.hi) {
		stack.go#L722: 				print("bp=", hex(bp), " min=", hex(adjinfo.old.lo), " max=", hex(adjinfo.old.hi), "\n")
		stack.go#L783: 		if bp != 0 && (bp < adjinfo.old.lo || bp >= adjinfo.old.hi) {
		stack.go#L785: 			print("bp=", hex(bp), " min=", hex(adjinfo.old.lo), " max=", hex(adjinfo.old.hi), "\n")
		stack.go#L830: 	for p := stk.lo; p < stk.hi; p++ {
		stack.go#L839: 		if stk.lo <= p && p < stk.hi && p > sghi {
		stack.go#L880: 		oldBot := adjinfo.old.hi - used
		stack.go#L908: 	used := old.hi - gp.sched.sp
		stack.go#L913: 	gcController.addScannableStack(getg().m.p.ptr(), int64(newsize)-int64(old.hi-old.lo))
		stack.go#L921: 		print("copystack gp=", gp, " [", hex(old.lo), " ", hex(old.hi-used), " ", hex(old.hi), "]", " -> [", hex(new.lo), " ", hex(new.hi-used), " ", hex(new.hi), "]/", newsize, "\n")
		stack.go#L927: 	adjinfo.delta = new.hi - old.hi
		stack.go#L932: 		if newsize < old.hi-old.lo && gp.parkingOnChan.Load() {
		stack.go#L956: 	memmove(unsafe.Pointer(new.hi-ncopy), unsafe.Pointer(old.hi-ncopy), ncopy)
		stack.go#L971: 	gp.sched.sp = new.hi - used
		stack.go#L982: 			gp.valgrindStackID = valgrindRegisterStack(unsafe.Pointer(new.lo), unsafe.Pointer(new.hi))
		stack.go#L984: 			valgrindChangeStack(gp.valgrindStackID, unsafe.Pointer(new.lo), unsafe.Pointer(new.hi))
		stack.go#L995: 		memclrNoHeapPointers(unsafe.Pointer(old.lo), old.hi-old.lo)
		stack.go#L1061: 			" sp=", hex(gp.sched.sp), " stack=[", hex(gp.stack.lo), ", ", hex(gp.stack.hi), "]\n",
		stack.go#L1112: 		print("runtime: newstack sp=", hex(sp), " stack=[", hex(gp.stack.lo), ", ", hex(gp.stack.hi), "]\n",
		stack.go#L1149: 	oldsize := gp.stack.hi - gp.stack.lo
		stack.go#L1158: 		used := gp.stack.hi - gp.sched.sp
		stack.go#L1177: 		print("runtime: sp=", hex(sp), " stack=[", hex(gp.stack.lo), ", ", hex(gp.stack.hi), "]\n")
		stack.go#L1284: 	oldsize := gp.stack.hi - gp.stack.lo
		stack.go#L1296: 	avail := gp.stack.hi - gp.stack.lo
		stack.go#L1297: 	if used := gp.stack.hi - gp.sched.sp + stackNosplit; used >= avail/4 {
		string.go#L181: 	return stk.lo <= ptr && ptr < stk.hi
		traceallocfree.go#L80: 		trace.GoroutineStackExists(gp.stack.lo, gp.stack.hi-gp.stack.lo)
		traceback.go#L566: 		print("\tstack=[", hex(gp.stack.lo), "-", hex(gp.stack.hi), "\n")
		traceback.go#L1377: 	if hi > stk.hi {
		traceback.go#L1378: 		hi = stk.hi
		traceback.go#L1382: 	print("stack: frame={sp:", hex(frame.sp), ", fp:", hex(frame.fp), "} stack=[", hex(stk.lo), ",", hex(stk.hi), ")\n")